A Tree Building Technique for Overlay Multicasting in DiffServ Domains

Overlay multicasting technology is now considered as a promising alternative to the native IP multicasting. While many studies are currently focused on how to build an overlay tree/mesh on top of conventional networks in a self-organized fashion, only limited attention has been directed toward QoS provisioning. QoS can be provisioned by leveraging the implementation of differentiated services in the Internet. In this paper, we have proposed an incremental insertion tree-building algorithm to avoid extensive signaling overhead in differentiated service domains. The simulation results depict that on an average our approach produces a tree with a cost of only 10% to 20% more than the fully costoptimized tree. The relative delay penalties generated by the incremental insertion algorithm is comparable to that of the previously proposed Narada scheme. Although our scheme is designed for differentiated services, the algorithm can also be adapted to integrated services as well.